ELPKG: A High-Accuracy Link Prediction Approach for Knowledge Graph Completion
نویسندگان
چکیده
منابع مشابه
Link Prediction via Matrix Completion
Ratha Pech, Hao Dong1,2,∗, Liming Pan, Hong Cheng, Zhou Tao1,2,∗ 1 CompleX Lab, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China 2 Big Data Research Center, University of Electronic Science and Technology of China, Chengdu 611731, People’s Republic of China and 3 Center for Robotics, University of Electronic Science and Technology of China, Ch...
متن کاملProjE: Embedding Projection for Knowledge Graph Completion
With the large volume of new information created every day, determining the validity of information in a knowledge graph and filling in its missing parts are crucial tasks for many researchers and practitioners. To address this challenge, a number of knowledge graph completion methods have been developed using low-dimensional graph embeddings. Although researchers continue to improve these mode...
متن کاملAttentive Path Combination for Knowledge Graph Completion
Knowledge graphs (KGs) are often significantly incomplete, necessitating a demand for KG completion. Path-based relation inference is one of the most important approaches to this task. Traditional methods treat each path between entity pairs as an atomic feature, thus inducing sparsity. Recently, neural network models solve this problem by decomposing a path as the sequence of relations in the ...
متن کاملOpen-World Knowledge Graph Completion
Knowledge Graphs (KGs) have been applied to many tasks including Web search, link prediction, recommendation, natural language processing, and entity linking. However, most KGs are far from complete and are growing at a rapid pace. To address these problems, Knowledge Graph Completion (KGC) has been proposed to improve KGs by filling in its missing connections. Unlike existing methods which hol...
متن کاملSemi-supervised Graph Embedding Approach to Dynamic Link Prediction
We propose a simple discrete time semi–supervised graph embedding approach to link prediction in dynamic networks. The learned embedding reflects information from both the temporal and cross–sectional network structures, which is performed by defining the loss function as a weighted sum of the supervised loss from past dynamics and the unsupervised loss of predicting the neighborhood context in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2019
ISSN: 2073-8994
DOI: 10.3390/sym11091096